0.07/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.12/0.35	% Computer : n015.cluster.edu
0.12/0.35	% Model    : x86_64 x86_64
0.12/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.35	% Memory   : 8042.1875MB
0.12/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.35	% CPULimit   : 1440
0.12/0.35	% WCLimit    : 180
0.12/0.35	% DateTime   : Thu Jul  4 07:28:39 EDT 2024
0.12/0.35	% CPUTime    : 
0.20/0.50	Running higher-order theorem proving
0.20/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.RwASzu70eF/E---3.1_5408.p
0.20/0.52	# Version: 3.2.0-ho
0.20/0.52	# Preprocessing class: HSSSSLSSSLMNSFA.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.52	# Starting new_ho_10 with 900s (5) cores
0.20/0.52	# Starting full_lambda_3 with 180s (1) cores
0.20/0.52	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.52	# Starting sh4l with 180s (1) cores
0.20/0.52	# sh4l with pid 5489 completed with status 0
0.20/0.52	# Result found by sh4l
0.20/0.52	# Preprocessing class: HSSSSLSSSLMNSFA.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.52	# Starting new_ho_10 with 900s (5) cores
0.20/0.52	# Starting full_lambda_3 with 180s (1) cores
0.20/0.52	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.52	# Starting sh4l with 180s (1) cores
0.20/0.52	# No SInE strategy applied
0.20/0.52	# Search class: HHUSF-FFSF22-DSFFMSBN
0.20/0.52	# partial match(1): HHUSF-FFSF22-SSFFMSBN
0.20/0.52	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.20/0.52	# Starting new_ho_10 with 109s (1) cores
0.20/0.52	# new_ho_10 with pid 5493 completed with status 0
0.20/0.52	# Result found by new_ho_10
0.20/0.52	# Preprocessing class: HSSSSLSSSLMNSFA.
0.20/0.52	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.52	# Starting new_ho_10 with 900s (5) cores
0.20/0.52	# Starting full_lambda_3 with 180s (1) cores
0.20/0.52	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.52	# Starting sh4l with 180s (1) cores
0.20/0.52	# No SInE strategy applied
0.20/0.52	# Search class: HHUSF-FFSF22-DSFFMSBN
0.20/0.52	# partial match(1): HHUSF-FFSF22-SSFFMSBN
0.20/0.52	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.20/0.52	# Starting new_ho_10 with 109s (1) cores
0.20/0.52	# Preprocessing time       : 0.001 s
0.20/0.52	# Presaturation interreduction done
0.20/0.52	
0.20/0.52	# Proof found!
0.20/0.52	# SZS status Theorem
0.20/0.52	# SZS output start CNFRefutation
0.20/0.52	thf(decl_22, type, in: $i > $i > $o).
0.20/0.52	thf(decl_23, type, dsetconstr: $i > ($i > $o) > $i).
0.20/0.52	thf(decl_24, type, dsetconstrI: $o).
0.20/0.52	thf(decl_25, type, binunion: $i > $i > $i).
0.20/0.52	thf(decl_26, type, binunionIR: $o).
0.20/0.52	thf(decl_27, type, symdiff: $i > $i > $i).
0.20/0.52	thf(decl_28, type, esk1_0: $i).
0.20/0.52	thf(decl_29, type, esk2_0: $i).
0.20/0.52	thf(decl_30, type, esk3_0: $i).
0.20/0.52	thf(dsetconstrI, axiom, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4))))))))), file('/export/starexec/sandbox/tmp/tmp.RwASzu70eF/E---3.1_5408.p', dsetconstrI)).
0.20/0.52	thf(symdiffI2, conjecture, ((dsetconstrI)=>(![X1:$i, X5:$i, X3:$i]:((~((in @ X3 @ X1))=>((in @ X3 @ X5)=>(in @ X3 @ (symdiff @ X1 @ X5)))))<=(binunionIR))), file('/export/starexec/sandbox/tmp/tmp.RwASzu70eF/E---3.1_5408.p', symdiffI2)).
0.20/0.52	thf(binunionIR, axiom, ((binunionIR)<=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X5)=>(in @ X3 @ (binunion @ X1 @ X5))))), file('/export/starexec/sandbox/tmp/tmp.RwASzu70eF/E---3.1_5408.p', binunionIR)).
0.20/0.52	thf(symdiff, axiom, ((symdiff)=(^[X1:$i, X5:$i]:(dsetconstr @ (binunion @ X1 @ X5) @ (^[X3:$i]:((~((in @ X3 @ X1))|~((in @ X3 @ X5)))))))), file('/export/starexec/sandbox/tmp/tmp.RwASzu70eF/E---3.1_5408.p', symdiff)).
0.20/0.52	thf(c_0_4, plain, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((X2 @ Z0))))))))), inference(fof_simplification,[status(thm)],[dsetconstrI])).
0.20/0.52	thf(c_0_5, negated_conjecture, ~((![X15:$i, X16:$i > $o, X17:$i]:(((in @ X17 @ X15)=>((X16 @ X17)=>(in @ X17 @ (dsetconstr @ X15 @ X16)))))=>(![X18:$i, X19:$i, X20:$i]:(((in @ X20 @ X19)=>(in @ X20 @ (binunion @ X18 @ X19))))=>![X1:$i, X5:$i, X3:$i]:((~(in @ X3 @ X1)=>((in @ X3 @ X5)=>(in @ X3 @ (symdiff @ X1 @ X5)))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[symdiffI2]), c_0_4]), binunionIR])])])).
0.20/0.52	thf(c_0_6, plain, ((symdiff)=(^[Z0/* 19 */:$i, Z1:$i]:(dsetconstr @ (binunion @ Z0 @ Z1) @ (^[Z2/* 9 */:$i]:((~((in @ Z2 @ Z0))|~((in @ Z2 @ Z1)))))))), inference(fof_simplification,[status(thm)],[symdiff])).
0.20/0.52	thf(c_0_7, negated_conjecture, ![X21:$i, X22:$i > $o, X23:$i, X24:$i, X25:$i, X26:$i]:(((~(in @ X23 @ X21)|(~(X22 @ X23)|(in @ X23 @ (dsetconstr @ X21 @ X22))))&((~(in @ X26 @ X25)|(in @ X26 @ (binunion @ X24 @ X25)))&(~(in @ esk3_0 @ esk1_0)&((in @ esk3_0 @ esk2_0)&~(in @ esk3_0 @ (symdiff @ esk1_0 @ esk2_0))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])).
0.20/0.52	thf(c_0_8, plain, ((symdiff)=(^[Z0/* 19 */:$i, Z1:$i]:(dsetconstr @ (binunion @ Z0 @ Z1) @ (^[Z2/* 9 */:$i]:((~((in @ Z2 @ Z0))|~((in @ Z2 @ Z1)))))))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.52	thf(c_0_9, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(((in @ X1 @ (dsetconstr @ X3 @ X2))|~((in @ X1 @ X3))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.52	thf(c_0_10, plain, ![X1:$i, X3:$i]:(((dsetconstr @ (binunion @ X1 @ X3) @ (^[Z0/* 9 */:$i]:((~((in @ Z0 @ X1))|~((in @ Z0 @ X3))))))=(symdiff @ X1 @ X3))), inference(arg_cong,[status(thm)],[c_0_8])).
0.20/0.52	thf(c_0_11, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(((in @ X1 @ (symdiff @ X3 @ X4))|~((~((in @ X1 @ X3))|~((in @ X1 @ X4))))|~((in @ X1 @ (binunion @ X3 @ X4))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.52	thf(c_0_12, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(((in @ X1 @ (symdiff @ X3 @ X4))|(in @ X1 @ X3)|~((in @ X1 @ (binunion @ X3 @ X4))))), inference(dynamic_cnf,[status(thm)],[c_0_11])).
0.20/0.52	thf(c_0_13, negated_conjecture, ![X1:$i, X4:$i, X3:$i]:(((in @ X1 @ (binunion @ X4 @ X3))|~((in @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.52	thf(c_0_14, negated_conjecture, ~((in @ esk3_0 @ (symdiff @ esk1_0 @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.52	thf(c_0_15, negated_conjecture, ![X1:$i, X3:$i, X4:$i]:(((in @ X1 @ (symdiff @ X3 @ X4))|(in @ X1 @ X3)|~((in @ X1 @ X4)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.20/0.52	thf(c_0_16, negated_conjecture, (in @ esk3_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.52	thf(c_0_17, negated_conjecture, ~((in @ esk3_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.52	thf(c_0_18, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])]), c_0_17]), ['proof']).
0.20/0.52	# SZS output end CNFRefutation
0.20/0.52	# Parsed axioms                        : 10
0.20/0.52	# Removed by relevancy pruning/SinE    : 0
0.20/0.52	# Initial clauses                      : 12
0.20/0.52	# Removed in clause preprocessing      : 6
0.20/0.52	# Initial clauses in saturation        : 6
0.20/0.52	# Processed clauses                    : 18
0.20/0.52	# ...of these trivial                  : 0
0.20/0.52	# ...subsumed                          : 0
0.20/0.52	# ...remaining for further processing  : 18
0.20/0.52	# Other redundant clauses eliminated   : 0
0.20/0.52	# Clauses deleted for lack of memory   : 0
0.20/0.52	# Backward-subsumed                    : 0
0.20/0.52	# Backward-rewritten                   : 0
0.20/0.52	# Generated clauses                    : 9
0.20/0.52	# ...of the previous two non-redundant : 6
0.20/0.52	# ...aggressively subsumed             : 0
0.20/0.52	# Contextual simplify-reflections      : 0
0.20/0.52	# Paramodulations                      : 4
0.20/0.52	# Factorizations                       : 0
0.20/0.52	# NegExts                              : 0
0.20/0.52	# Equation resolutions                 : 0
0.20/0.52	# Disequality decompositions           : 0
0.20/0.52	# Total rewrite steps                  : 2
0.20/0.52	# ...of those cached                   : 0
0.20/0.52	# Propositional unsat checks           : 0
0.20/0.52	#    Propositional check models        : 0
0.20/0.52	#    Propositional check unsatisfiable : 0
0.20/0.52	#    Propositional clauses             : 0
0.20/0.52	#    Propositional clauses after purity: 0
0.20/0.52	#    Propositional unsat core size     : 0
0.20/0.52	#    Propositional preprocessing time  : 0.000
0.20/0.52	#    Propositional encoding time       : 0.000
0.20/0.52	#    Propositional solver time         : 0.000
0.20/0.52	#    Success case prop preproc time    : 0.000
0.20/0.52	#    Success case prop encoding time   : 0.000
0.20/0.52	#    Success case prop solver time     : 0.000
0.20/0.52	# Current number of processed clauses  : 11
0.20/0.52	#    Positive orientable unit clauses  : 4
0.20/0.52	#    Positive unorientable unit clauses: 0
0.20/0.52	#    Negative unit clauses             : 2
0.20/0.52	#    Non-unit-clauses                  : 5
0.20/0.52	# Current number of unprocessed clauses: 0
0.20/0.52	# ...number of literals in the above   : 0
0.20/0.52	# Current number of archived formulas  : 0
0.20/0.52	# Current number of archived clauses   : 7
0.20/0.52	# Clause-clause subsumption calls (NU) : 9
0.20/0.52	# Rec. Clause-clause subsumption calls : 7
0.20/0.52	# Non-unit clause-clause subsumptions  : 0
0.20/0.52	# Unit Clause-clause subsumption calls : 0
0.20/0.52	# Rewrite failures with RHS unbound    : 0
0.20/0.52	# BW rewrite match attempts            : 1
0.20/0.52	# BW rewrite match successes           : 0
0.20/0.52	# Condensation attempts                : 18
0.20/0.52	# Condensation successes               : 0
0.20/0.52	# Termbank termtop insertions          : 1113
0.20/0.52	# Search garbage collected termcells   : 238
0.20/0.52	
0.20/0.52	# -------------------------------------------------
0.20/0.52	# User time                : 0.004 s
0.20/0.52	# System time              : 0.001 s
0.20/0.52	# Total time               : 0.005 s
0.20/0.52	# Maximum resident set size: 1776 pages
0.20/0.52	
0.20/0.52	# -------------------------------------------------
0.20/0.52	# User time                : 0.005 s
0.20/0.52	# System time              : 0.003 s
0.20/0.52	# Total time               : 0.008 s
0.20/0.52	# Maximum resident set size: 1700 pages
0.20/0.52	% E---3.1 exiting
0.20/0.52	% E exiting
0.20/0.52	EOF